List Decodability of Symbol-Pair Codes
نویسندگان
چکیده
منابع مشابه
List Decodability of Random Linear Concatenated Codes
Ñ . These results are shown by choosing the code at random. However, as we saw in Chapter 4 the explicit constructions of codes over finite alphabets are nowhere close to achieving list-decoding capacity. The linear codes in Chapter 4 are based on code concatenation. A natural question to ask is whether linear codes based on code concatenation can get us to list-decoding capacity for fixed al...
متن کاملOn the List-Decodability of Random Linear Rank-Metric Codes
The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an Fq-linear rank-metric code over F m×n q of rate R = (1 − ρ)(1 − n m ρ) − ε is shown to be (with high probability) list-decodable up to fractional radius ρ ∈ (0, 1) with lists of size at most Cρ,q ε , where Cρ,q is a constant depending only on ρ and q. This matches the bo...
متن کاملOn the List Decodability of Self-orthogonal Rank Metric Codes
V. Guruswami and N. Resch prove that the list decodability of Fq-linear rank metric codes is as good as that of random rank metric codes in [17]. Due to the potential applications of self-orthogonal rank metric codes, we focus on list decoding of them. In this paper, we prove that with high probability, an Fq-linear self-orthogonal rank metric code over Fn×m q of rate R = (1 − τ)(1 − n mτ) − is...
متن کاملNew constructions of MDS symbol-pair codes
Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with large minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining maximal mi...
متن کاملList decodability at small radii
A′(n,d,e), the smallest ` for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ` up to radius e, is determined for all d ≥ 2e−3. As a result, A′(n,d,e) is determined for all e≤ 4, except for 42 values of n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2904998